TSTP Solution File: ITP074^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP074^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 08:06:52 EDT 2024

% Result   : Theorem 0.40s 0.64s
% Output   : CNFRefutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   19 (  13 unt;   6 typ;   0 def)
%            Number of atoms       :   13 (  12 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   68 (   6   ~;   0   |;   0   &;  62   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   18 (   2   ^  16   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    hF_Mirabelle_hf: $tType ).

thf(decl_24,type,
    zero_z189798548lle_hf: hF_Mirabelle_hf ).

thf(decl_36,type,
    hF_Mirabelle_hinsert: hF_Mirabelle_hf > hF_Mirabelle_hf > hF_Mirabelle_hf ).

thf(decl_38,type,
    hF_Mirabelle_hpair: hF_Mirabelle_hf > hF_Mirabelle_hf > hF_Mirabelle_hf ).

thf(decl_49,type,
    x: hF_Mirabelle_hf ).

thf(decl_50,type,
    y: hF_Mirabelle_hf ).

thf(fact_18_hinsert__nonempty,axiom,
    ! [X1: hF_Mirabelle_hf,X14: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hinsert @ X1 @ X14 )
     != zero_z189798548lle_hf ),
    file('/export/starexec/sandbox/tmp/tmp.hhGaC9xxeu/E---3.1_12582.p',fact_18_hinsert__nonempty) ).

thf(fact_13_hpair__def,axiom,
    ( hF_Mirabelle_hpair
    = ( ^ [X10: hF_Mirabelle_hf,X11: hF_Mirabelle_hf] : ( hF_Mirabelle_hinsert @ ( hF_Mirabelle_hinsert @ X10 @ zero_z189798548lle_hf ) @ ( hF_Mirabelle_hinsert @ ( hF_Mirabelle_hinsert @ X10 @ ( hF_Mirabelle_hinsert @ X11 @ zero_z189798548lle_hf ) ) @ zero_z189798548lle_hf ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.hhGaC9xxeu/E---3.1_12582.p',fact_13_hpair__def) ).

thf(conj_0,conjecture,
    ( ( hF_Mirabelle_hpair @ x @ y )
   != zero_z189798548lle_hf ),
    file('/export/starexec/sandbox/tmp/tmp.hhGaC9xxeu/E---3.1_12582.p',conj_0) ).

thf(c_0_3,plain,
    ! [X1: hF_Mirabelle_hf,X14: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hinsert @ X1 @ X14 )
     != zero_z189798548lle_hf ),
    inference(fof_simplification,[status(thm)],[fact_18_hinsert__nonempty]) ).

thf(c_0_4,plain,
    ! [X741: hF_Mirabelle_hf,X742: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hpair @ X741 @ X742 )
      = ( hF_Mirabelle_hinsert @ ( hF_Mirabelle_hinsert @ X741 @ zero_z189798548lle_hf ) @ ( hF_Mirabelle_hinsert @ ( hF_Mirabelle_hinsert @ X741 @ ( hF_Mirabelle_hinsert @ X742 @ zero_z189798548lle_hf ) ) @ zero_z189798548lle_hf ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_13_hpair__def])]) ).

thf(c_0_5,plain,
    ! [X1178: hF_Mirabelle_hf,X1179: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hinsert @ X1178 @ X1179 )
     != zero_z189798548lle_hf ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_3])]) ).

thf(c_0_6,plain,
    ! [X808: hF_Mirabelle_hf,X809: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hpair @ X808 @ X809 )
      = ( hF_Mirabelle_hinsert @ ( hF_Mirabelle_hinsert @ X808 @ zero_z189798548lle_hf ) @ ( hF_Mirabelle_hinsert @ ( hF_Mirabelle_hinsert @ X808 @ ( hF_Mirabelle_hinsert @ X809 @ zero_z189798548lle_hf ) ) @ zero_z189798548lle_hf ) ) ),
    inference(variable_rename,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ( ( hF_Mirabelle_hpair @ x @ y )
    = zero_z189798548lle_hf ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_8,plain,
    ! [X1: hF_Mirabelle_hf,X2: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hinsert @ X1 @ X2 )
     != zero_z189798548lle_hf ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ! [X1: hF_Mirabelle_hf,X2: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hpair @ X1 @ X2 )
      = ( hF_Mirabelle_hinsert @ ( hF_Mirabelle_hinsert @ X1 @ zero_z189798548lle_hf ) @ ( hF_Mirabelle_hinsert @ ( hF_Mirabelle_hinsert @ X1 @ ( hF_Mirabelle_hinsert @ X2 @ zero_z189798548lle_hf ) ) @ zero_z189798548lle_hf ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,negated_conjecture,
    ( ( hF_Mirabelle_hpair @ x @ y )
    = zero_z189798548lle_hf ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    ! [X1: hF_Mirabelle_hf,X2: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hpair @ X1 @ X2 )
     != zero_z189798548lle_hf ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_10,c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.17  % Problem    : ITP074^1 : TPTP v8.1.2. Released v7.5.0.
% 0.16/0.18  % Command    : run_E %s %d THM
% 0.18/0.40  % Computer : n007.cluster.edu
% 0.18/0.40  % Model    : x86_64 x86_64
% 0.18/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.40  % Memory   : 8042.1875MB
% 0.18/0.40  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40  % CPULimit   : 300
% 0.18/0.40  % WCLimit    : 300
% 0.18/0.40  % DateTime   : Fri May  3 12:38:05 EDT 2024
% 0.18/0.40  % CPUTime    : 
% 0.39/0.57  Running higher-order theorem proving
% 0.39/0.57  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.hhGaC9xxeu/E---3.1_12582.p
% 0.40/0.64  # Version: 3.1.0-ho
% 0.40/0.64  # Preprocessing class: HSLSSMSSSSSNSFA.
% 0.40/0.64  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.64  # Starting new_ho_11 with 1500s (5) cores
% 0.40/0.64  # Starting post_as_ho6 with 300s (1) cores
% 0.40/0.64  # Starting sh9 with 300s (1) cores
% 0.40/0.64  # Starting sh5l with 300s (1) cores
% 0.40/0.64  # post_as_ho6 with pid 12711 completed with status 0
% 0.40/0.64  # Result found by post_as_ho6
% 0.40/0.64  # Preprocessing class: HSLSSMSSSSSNSFA.
% 0.40/0.64  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.64  # Starting new_ho_11 with 1500s (5) cores
% 0.40/0.64  # Starting post_as_ho6 with 300s (1) cores
% 0.40/0.64  # SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.40/0.64  # Search class: HGHSM-FSLF31-MSFFFSBN
% 0.40/0.64  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.64  # Starting new_ho_10 with 163s (1) cores
% 0.40/0.64  # new_ho_10 with pid 12722 completed with status 0
% 0.40/0.64  # Result found by new_ho_10
% 0.40/0.64  # Preprocessing class: HSLSSMSSSSSNSFA.
% 0.40/0.64  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.64  # Starting new_ho_11 with 1500s (5) cores
% 0.40/0.64  # Starting post_as_ho6 with 300s (1) cores
% 0.40/0.64  # SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.40/0.64  # Search class: HGHSM-FSLF31-MSFFFSBN
% 0.40/0.64  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.64  # Starting new_ho_10 with 163s (1) cores
% 0.40/0.64  # Preprocessing time       : 0.004 s
% 0.40/0.64  # Presaturation interreduction done
% 0.40/0.64  
% 0.40/0.64  # Proof found!
% 0.40/0.64  # SZS status Theorem
% 0.40/0.64  # SZS output start CNFRefutation
% See solution above
% 0.40/0.64  # Parsed axioms                        : 376
% 0.40/0.64  # Removed by relevancy pruning/SinE    : 217
% 0.40/0.64  # Initial clauses                      : 250
% 0.40/0.64  # Removed in clause preprocessing      : 7
% 0.40/0.64  # Initial clauses in saturation        : 243
% 0.40/0.64  # Processed clauses                    : 395
% 0.40/0.64  # ...of these trivial                  : 25
% 0.40/0.64  # ...subsumed                          : 93
% 0.40/0.64  # ...remaining for further processing  : 277
% 0.40/0.64  # Other redundant clauses eliminated   : 45
% 0.40/0.64  # Clauses deleted for lack of memory   : 0
% 0.40/0.64  # Backward-subsumed                    : 2
% 0.40/0.64  # Backward-rewritten                   : 2
% 0.40/0.64  # Generated clauses                    : 969
% 0.40/0.64  # ...of the previous two non-redundant : 607
% 0.40/0.64  # ...aggressively subsumed             : 0
% 0.40/0.64  # Contextual simplify-reflections      : 0
% 0.40/0.64  # Paramodulations                      : 920
% 0.40/0.64  # Factorizations                       : 0
% 0.40/0.64  # NegExts                              : 0
% 0.40/0.64  # Equation resolutions                 : 50
% 0.40/0.64  # Disequality decompositions           : 0
% 0.40/0.64  # Total rewrite steps                  : 386
% 0.40/0.64  # ...of those cached                   : 281
% 0.40/0.64  # Propositional unsat checks           : 0
% 0.40/0.64  #    Propositional check models        : 0
% 0.40/0.64  #    Propositional check unsatisfiable : 0
% 0.40/0.64  #    Propositional clauses             : 0
% 0.40/0.64  #    Propositional clauses after purity: 0
% 0.40/0.64  #    Propositional unsat core size     : 0
% 0.40/0.64  #    Propositional preprocessing time  : 0.000
% 0.40/0.64  #    Propositional encoding time       : 0.000
% 0.40/0.64  #    Propositional solver time         : 0.000
% 0.40/0.64  #    Success case prop preproc time    : 0.000
% 0.40/0.64  #    Success case prop encoding time   : 0.000
% 0.40/0.64  #    Success case prop solver time     : 0.000
% 0.40/0.64  # Current number of processed clauses  : 111
% 0.40/0.64  #    Positive orientable unit clauses  : 29
% 0.40/0.64  #    Positive unorientable unit clauses: 2
% 0.40/0.64  #    Negative unit clauses             : 12
% 0.40/0.64  #    Non-unit-clauses                  : 68
% 0.40/0.64  # Current number of unprocessed clauses: 597
% 0.40/0.64  # ...number of literals in the above   : 1234
% 0.40/0.64  # Current number of archived formulas  : 0
% 0.40/0.64  # Current number of archived clauses   : 148
% 0.40/0.64  # Clause-clause subsumption calls (NU) : 2653
% 0.40/0.64  # Rec. Clause-clause subsumption calls : 2093
% 0.40/0.64  # Non-unit clause-clause subsumptions  : 69
% 0.40/0.64  # Unit Clause-clause subsumption calls : 103
% 0.40/0.64  # Rewrite failures with RHS unbound    : 0
% 0.40/0.64  # BW rewrite match attempts            : 94
% 0.40/0.64  # BW rewrite match successes           : 71
% 0.40/0.64  # Condensation attempts                : 395
% 0.40/0.64  # Condensation successes               : 0
% 0.40/0.64  # Termbank termtop insertions          : 26306
% 0.40/0.64  # Search garbage collected termcells   : 5804
% 0.40/0.64  
% 0.40/0.64  # -------------------------------------------------
% 0.40/0.64  # User time                : 0.040 s
% 0.40/0.64  # System time              : 0.009 s
% 0.40/0.64  # Total time               : 0.049 s
% 0.40/0.64  # Maximum resident set size: 3116 pages
% 0.40/0.64  
% 0.40/0.64  # -------------------------------------------------
% 0.40/0.64  # User time                : 0.051 s
% 0.40/0.64  # System time              : 0.013 s
% 0.40/0.64  # Total time               : 0.064 s
% 0.40/0.64  # Maximum resident set size: 2312 pages
% 0.40/0.64  % E---3.1 exiting
% 0.40/0.65  % E exiting
%------------------------------------------------------------------------------